Binary Decision Diagrams and Its Variable Ordering for Disjoint Network
نویسندگان
چکیده
Binary Decision Diagrams and Its Variable Ordering for Disjoint Network Manoj Singhal Associate professor, Department of Information Technology, Accurate Institute of Management & Technology, Greater Noida (U.P.), India, Email: [email protected] Girish Sharma Associate Professor, Department of Computer Applications, Bhai Parmanand Institute of Business Studies, New Delhi Email: [email protected] R. K. Chauhan Professor, Département of Computer Science and Applications, Kurukshetra University, Kurukshetra Email : [email protected]
منابع مشابه
A New Approach for Finding the various Optimal Variable Ordering to Generate the Binary Decision Diagrams (BDD) of a Computer Communication Network
In this paper we have adopted a new approach for finding the various optimal ordering to generate the binary decision diagrams of a computer communication network. We have shown that these binary decision diagrams are of minimum size and take same time to generate. If two binary decision diagrams have the same size and representing the same Boolean function, then these binary decision diagrams ...
متن کاملGenetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملA Survey of Static Variable Ordering Heuristics for Efficient BDD/MDD Construction
The problem of finding an optimal variable ordering for Binary Decision Diagrams (BDD) or Multi-Valued Decision Diagrams (MDD) is widely known to be NP-Complete. This paper presents a survey of static heuristic techniques applied to ordering the variables of the BDD/MDD under construction in order to minimize the overall size of the resulting decision diagram.
متن کاملDisjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD. This paper presents an...
متن کاملLearning Ordered Binary Decision Diagrams
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...
متن کامل